Minimally k-factor-critical graphs
نویسندگان
چکیده
A graph G of order n is k-factor-critical, where k is an integer of the same parity as n with 0 ::; k ::; n, if G X has a perfect matching for any set X of k vertices of G. A k-factor-critical graph G is called minimal if for any edge e E E(G), G e is not k-factor-critical. In this paper we study some properties of minimally k-factor-critical graphs, in particular a bound on the minimum degree, and characterize (n 4)and minimally (n 4)-factor-critical graphs.
منابع مشابه
Minimally non-Pfaffian graphs
We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sharp contrast with the bipartite case, as Little [7] proved that every bipartite non-Pfaffian graph contains a matching minor isomorphic to K3,3. We relax the notion of a matching minor and conjecture that there are onl...
متن کاملReducible chains in several types of 2-connected graphs
Zhang, F. and X. Guo, Reducible chains in several types of 2-connected graphs, Discrete Mathematics 105 (1992) 285-291. Let F& 4, $ and 8 denote the sets of all 2-connected graphs, minimally 2-connected graphs, critically 2-connected graphs, and critically and minimally 2-connected graphs, respectively. We introduce the concept of %,-reducible chains of a graph G in %,, i = 0, 1, 2, 3, and give...
متن کاملProduct of normal edge-transitive Cayley graphs
For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.
متن کاملExamples of goal-minimally k-diametric graphs for some small values of k
A graph G with diameter k is said to be goal-minimally k-diametric if for every edge uv of G distance dG−uv(x, y) > k if and only if {x, y} = {u, v}. It is rather difficult to construct such graphs. In this paper we give examples of such graphs for several small values of k. In particular, we present infinitely many goal-minimally 4-diametric graphs and 6diametric graphs.
متن کاملOn minimally k-extendable graphs
Let G be a simple connected graph on 2n vertices with a perfect matching. G is k-extendable if for any set M of k independent edges, there exists a perfect matching in G containing all the edges of M. G is minimally k-extendable if G is k-extendable but G-uv is not k-extendable for every pair of adjacent vertices u and v of G. The problem that arises is that of characterizing k-extendable and m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 17 شماره
صفحات -
تاریخ انتشار 1998